Querying the Semantic Web with Preferences
نویسندگان
چکیده
Ranking is an important concept to avoid empty or overfull and unordered result sets. However, such scoring can only express total orders, which restricts its usefulness when several factors influence result relevance. A more flexible way to express relevance is the notion of preferences. Users state which kind of answers they ‘prefer’ by adding soft constraints to their queries. Current approaches in the SemanticWeb offer only limited facilities for specification of scoring and result ordering. There is no common language element to express and formalize ranking and preferences. We present a comprehensive extension of SPARQL which directly supports the expression of preferences. This includes formal syntax and semantics of preference expressions for SPARQL. Additionally, we report our implementation of preference query processing, which is based on the ARQ query engine.
منابع مشابه
Developing a BIM-based Spatial Ontology for Semantic Querying of 3D Property Information
With the growing dominance of complex and multi-level urban structures, current cadastral systems, which are often developed based on 2D representations, are not capable of providing unambiguous spatial information about urban properties. Therefore, the concept of 3D cadastre is proposed to support 3D digital representation of land and properties and facilitate the communication of legal owners...
متن کاملGeoTemporal Reasoning for the Social Semantic Web
We demonstrate a Semantic Web application that organizes social events for friends in the larger San Francisco Bay Area using real data from available web sources. We use a collection of techniques that will be at the heart of the next wave of applications on the web; entity extraction, querying federated databases, efficient spatial reasoning, temporal reasoning, practical RDFS++ reasoning, re...
متن کاملA New Framework for Querying Semantic Networks
Open World information systems, such as Digital Libraries or the Web, can successfully be accessed by text search engines. Semantic networks of RDF triples however, the core of the Semantic Web, are not easily accessible by such a global query paradigm. Querying individually hundreds of different kinds of properties leaves a huge recall gap to text retrieval, whereas a global restriction to “co...
متن کاملIntegrating RDF Querying Capabilities into a Distributed Search Infrastructure
The Semantic Web is inherently distributed, and covers both metadata and full-text information. Semantic search therefore can profit a lot from peer-to-peer infrastructures as well as from powerful metadata search functionalities based on full-text search technologies. In this paper we focus on an approach extending an existing P2P search infrastructure with RDF querying capabilities, which bot...
متن کاملA procedure for Web Service Selection Using WS-Policy Semantic Matching
In general, Policy-based approaches play an important role in the management of web services, for instance, in the choice of semantic web service and quality of services (QoS) in particular. The present research work illustrates a procedure for the web service selection among functionality similar web services based on WS-Policy semantic matching. In this study, the procedure of WS-Policy publi...
متن کامل